VERTICAL ALIGNMENT ANALYSIS

Date:July 3RD 1999

This is a USER RPL program written by 	GEORGE SARKODEE
P.O. BOX DS 1618
DANSOMAN
ACCRA,GHANA
W.AFRICA

E-mail : gsark@hotmail.com

I wrote this program about two years ago, but then I did not have Internet access to upload.  I got  the inspiration to write it after using MOSS for some time.

This program will generate all the design levels along the centreline of a road from Start of project to End of project.  Due to RAM considerations, it will be wiser to run it in shorter sections of the whole road project.............say approximately 1 km at a time.

The files are:-
 
VERTI 	(498 bytes)
NPT 		(2181 bytes)
DATA 		(139 bytes)
CRV		 (520 bytes)
Rlmod 		(363 bytes)
MNU 		(63 bytes)
LVgen  	 (3529 bytes)
FIXX		 (160 bytes)
PRNT  	 (2197)
SSTATS	 (1276 bytes)

The grobs are:-

1)	STATDSP 	(345 bytes)
2)	PS1 		(171 bytes)
3)	PG1 		(1106 bytes)

Total no.of bytes :  	12548 bytes

My program basically makes very good use of the parallel list processing capabilities of the 48 and just spews out the levels for you at any specified interval...................... whether it is a 500m or a 10km road........ it can handle it (depending on the RAM available to you).  When it begins to get really busy, just go and grab a drink.

No checks are made in the program for things like whether a particular grade is acceptable or not.  The assumption is made that you have established your appropriate IP's and determined the length or radius of curve you want to fit in between the grades.



INPUTS required are basically

1)	All VIP's levels (including the first and the last points)
2)	All their respective chainages
3)	Length of curves (with options for assymetrical curves), otherwise the radii format.
4)	Special chainages, if any.

The program is self checking; just in case any of your curves overlap, you are prompted. You also have the opportunity to inspect all 'e' values and alter them if you have to, before proceeding.

OUTPUTS: A complete or partial output can be specified and the answers are spewed into PICT in batches of twenty (20) stations.  This is preceded by a display of the summary statistics.  All important stations are tagged with the appropriate texts.
All the numeric data is stored in SDAT ( reserved statistics variable)

The menu area will be littered with many variables.  I left them there because you may want to inspect some of them.   Just be careful when purging them.  Some of the variables to be purged in the LEVELS directory are "Tp, T, remark, Mo, PPAR, MAT, ND, SDAT "Purge LEVELS directory as well.  In the main directory, the variables to be purged are "Q,T, NSB, P1 prstll, int, Prend, TRNK, Z, et, STRT, cl~rl,g, S, CVF, prschl, remark, cvform, BVC, EVC,cl~r, lv,ch, PRJ".

HOW TO RUN IT

Simply execute VERTI from the menu.

RULES:

1.	No.of IP's must be greater or equal to 3
2.	For curves, in length format, all values must be positive (+).
In Radii format, crest curves are negative (-) whereas sag curves are positive (+).
3.	All special chainages, including those that coincide with interval points must be specified.
4.	All partial outputs should start and end on a interval (computed) point.

The following came as an after thought.

An attempt was made to include what I refer to as 'Hanging' or end-truncated curves.  These are relevant to the end conditions (start and end) of the road only.
A typical area of application would be for an undulating landscape with a network of roads with many T-junctions (say).  These tie points could be any point of a curve (in this case, it must be after the VIP1 for start conditions and after VIPn- for end conditions).
The word 'phantom' simply means 'that non-existent part of the curve'.  I 'ope this doesn't scare you.

Other rules

For the start condition,
1)	'Start of project', must coincide with an interval point.
2)	BVC (phantom)=VIP 1
3)	BVC (phantom) < Project start chainage < VIP 2; in other words, it must lie in the first half of the curve.


For the end condition,

1)	'End of project ' must also coincide with an interval point.
2)	Always extend the last grade beyond the Project end chainage.
3)	Project end chainage _VIPn.
4)	VIPn=EVCn (phantom)
5)	VIPn-1< Project end chainage < VIPn; in other words, it must lie in the second half of the curve.
6)	Project end chainage = EVCn (phantom)

NB:	You may never encounter this so you may never have to use this option.  If you ever do and encounter any bugs, please let me know.

I hope this proves useful to some of you 48 guys out there.

I haven't had much time to learn Assembly language and ML yet, however any comments or suggestions are welcome.

Please direct them to the above e-mail address.  Peace.

George Sarkodee
gsark@hotmail.com


